Two generalizations of the Gleason–Kahane–Zelazko theorem
نویسندگان
چکیده
منابع مشابه
Two Generalizations of the Gleason-kahane-z̀elazko Theorem
In this article we obtain 2 generalizations of the well known Gleason-Kahane-Z̀elazko Theorem. We consider a unital Banach algebra A, and a continuous unital linear mapping φ of A into Mn(C) – the n × n matrices over C. The first generalization states that if φ sends invertible elements to invertible elements, then the kernel of φ is contained in a proper two sided closed ideal of finite codimen...
متن کاملGeneralizations of Hedberg's Theorem
As the groupoid interpretation by Hofmann and Streicher shows, uniqueness of identity proofs (UIP) is not provable. Generalizing a theorem by Hedberg, we give new characterizations of types that satisfy UIP. It turns out to be natural in this context to consider constant endofunctions. For such a function, we can look at the type of its fixed points. We show that this type has at most one eleme...
متن کاملa case study of the two translators of the holy quran: tahereh saffarzadeh and laleh bakhtiar
بطورکلی، کتاب های مقدسی همچون قران کریم را خوانندگان میتوان مطابق با پیش زمینه های مختلفی که درند درک کنند. محقق تلاش کرده نقش پیش زمینه اجتماعی-فرهنگی را روی ایدئولوژی های مترجمین زن و در نتیجه تاثیراتش را روی خواندن و ترجمه آیات قرآن کریم بررسی کند و ببیند که آیا تفاوت های واژگانی عمده ای میان این مترجمین وجود دارد یا نه. به این منظور، ترجمه 24 آیه از آیات قرآن کریم مورد بررسی مقایسه ای قرار ...
15 صفحه اولGeneralizations of Wei's Duality Theorem
Wei’s celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two Wei-type duality theorems for new combinatorial structures that are introduced and named demi-matroids. These generalize matroids and are the appropriate com...
متن کاملApplications and Generalizations of the Approximation Theorem
In its basic form, the approximation theorem referred to provides simple n n combinatorial models for spaces ~ E X, where X is a connected based space. The first such result was given by James [26], who showed that ~EX is equivalent to the James construction MX. The unpublished preprint form of Dyer and gashof's paper [25] gave an approximation to QX = lira ~nEnx, and Milgram [41] gave a cellul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1997
ISSN: 0030-8730
DOI: 10.2140/pjm.1997.177.27